Optimal Finite Field Multipliers for FPGAs
نویسندگان
چکیده
With the end goal of implementing optimal Reed-Solomon error control decoders on FPGAs, we characterize the FPGA performance of several finite field multiplier designs reported in the literature. We discover that finite field multipliers optimized for VLSI implementation are not optimized for FPGA implementation. Based on this observation, we discuss the relative merits of each multiplier design and show why each does not perform well on FPGAs. We then suggest how to improve the performance of many finite field multiplier designs.
منابع مشابه
A Super-Serial Galois Fields Multiplier for FPGAs and its Application to Public-Key Algorithms
This contribution introduces a scalable multiplier architecture for Galois field GF(2 k) amenable for field programmable gate arrays (FPGAs) implementations. This architecture is well suited for the implementation of public-key cryptosystems which require pro-grammable multipliers in large Galois fields. The architecture trades a reduction in resources with an increase in the number of clock cy...
متن کاملOptimization of Rns Fir Filters for 6-inputs Lut Based Fpgas
In this paper optimized Residue Number System (RNS) arithmetic blocks to better exploit some of the architectural characteristics of the last generation FPGAs are presented. The implementation of modulo m adders, constant and general multipliers, input and output converters is presented. These architectures are based on moduli sets chosen in order to optimally use the six inputs Look-Up Tables ...
متن کاملArea/performance trade-off analysis of an FPGA digit-serial GFð2Þ Montgomery multiplier based on LFSR
Montgomery Multiplication is a common and important algorithm for improving the efficiency of public key cryptographic algorithms, like RSA and Elliptic Curve Cryptography (ECC). A natural choice for implementing this time consuming multiplication defined on finite fields, mainly over GFð2Þ, is the use of Field Programmable Gate Arrays (FPGAs) for being reconfigurable, flexible and physically s...
متن کاملArray Multipliers for High Throughput in Xilinx FPGAs with 6-Input LUTs
Multiplication is the dominant operation for many applications implemented on field-programmable gate arrays (FPGAs). Although most current FPGA families have embedded hard multipliers, soft multipliers using lookup tables (LUTs) in the logic fabric remain important. This paper presents a novel two-operand addition circuit (patent pending) that combines radix-4 partial-product generation with a...
متن کاملCombined Integer and Variable Precision (CIVP) Floating Point Multiplication Architecture for FPGAs
In this paper, we propose an architecture/methodology for making FPGAs suitable for integer as well as variable precision floating point multiplication. The proposed work will of great importance in applications which requires variable precision floating point multiplication such as multi-media processing applications. In the proposed architecture/methodology, we propose the replacement of exis...
متن کامل